Graph Transformation and Other Rule-Based Formalisms with Incomplete Information

نویسنده

  • H. Ehrig
چکیده

A general framework is presented for extending graph transformation and other rule-based formalisms in such a way that transformations with incomplete information can be handled. This extension is motivated by the need to model the behaviour of open systems in different application areas using graph transformations and Petri nets. The following two problems are central within this general framework.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysing Graph Transformation Systems using Extended Methods from Constraint Handling Rules

Constraint Handling Rules (CHR) [1] has become a general-purpose rule-based programming language throughout the last decade. The relations to many other formalisms have been investigated [2] and often results could be transferred from CHR to other formalisms, or vice versa. Graph Transformation Systems (GTS) [3], which have been developed in the 60ies and have become increasingly popular, have ...

متن کامل

Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information

Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is the ability to express this kind of interaction. Classical rule-based approaches like Petri nets and graph transformation are not suited for this purpose because they assume to have complete control about the state a...

متن کامل

Workshop Coordinators:

The notion of “rule” is ubiqitous in computer science, from theoretical formalisms to practical programming languages. Matured rulebased programming experiences a renaissance due to its applications in areas such as business rules, semantic web, computational biology, medical diagnosis, software verification, and security. We will embed rule-based approaches into the Constraint Handling Rules (...

متن کامل

Using a Fuzzy Rule-based Algorithm to Improve Routing in MPLS Networks

Today, the use of wireless and intelligent networks are widely used in many fields such as information technology and networking. There are several types of these networks that MPLS networks are one of these types. However, in MPLS networks there are issues and problems in the design and implementation discussion, for example security, throughput, losses, power consumption and so on. Basically,...

متن کامل

Analyzing Graph Transformation Systems through Constraint Handling Rules

Graph transformation systems (GTS) and constraint handling rules (CHR) are nondeterministic rule-based state transition systems. CHR is well-known for its powerful confluence and program equivalence analyses, for which we provide the basis in this work to apply them to GTS. We give a sound and complete embedding of GTS in CHR, investigate confluence of an embedded GTS, and provide a program equ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998